Every polynomial-time 1-degree collapses if and only if P = PSPACE
نویسندگان
چکیده
منابع مشابه
Every polynomial-time 1-degree collapses if and only if P = PSPACE
A set A is m-reducible (or Karp-reducible) to B if and only if there is a polynomial-time computable function f such that, for all x, x ∈ A if and only if f(x) ∈ B. Two sets are: • 1-equivalent if and only if each is m-reducible to the other by one-one reductions; • p-invertible equivalent if and only if each is m-reducible to the other by one-one, polynomial-time invertible reductions; and • p...
متن کاملEvery Polynomial-Time 1-Degree Collapses iff P=PSPACE
A set A is m-reducible (or Karp-reducible) to B i there is a polynomial-time computable function f such that, for all x, x 2 A () f(x) 2 B. Two sets are: 1-equivalent i each is m-reducible to the other by one-one reductions; p-invertible equivalent i each is m-reducible to the other by one-one, polynomial-time invertible reductions; and p-isomorphic i there is an m-reduction from one set to the...
متن کاملMarkets are efficient if and only if P = NP
I prove that if markets are efficient, meaning current prices fully reflect all information available in past prices, then P = NP , meaning every computational problem whose solution can be verified in polynomial time can also be solved in polynomial time. I also prove the converse by showing how we can “program” the market to solve NP -complete problems. Since P probably does not equal NP , ma...
متن کاملEmbedding If and Only If
Compounds of indicative conditionals present some puzzling phenomena. Perhaps most striking, some nested indicative conditionals are uninterpretable. Proponents of NTV hold that indicative conditionals do not have truth values, and they use this to explain why nested indicative conditionals are sometimes uninterpretable: the embedded conditional does not provide the truth conditions needed by t...
متن کاملOnTruth-Conditions for If (but Not Quite Only If )
For—according to the lore—any attempt at pullingoff this featwill reduce themtomaterial implicationand that is decidedlynot agoodwayof assigning truth-conditions to ordinary indicative if s. That is too bad since it seems like they are bounded from above by strict implication (they are true when their antecedents straight out imply their consequents), are bounded from below by material implicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2004
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1096901763